a(b(x1)) → b(a(a(x1)))
b(x1) → c(a(c(x1)))
a(a(x1)) → a(c(a(x1)))
↳ QTRS
↳ DependencyPairsProof
a(b(x1)) → b(a(a(x1)))
b(x1) → c(a(c(x1)))
a(a(x1)) → a(c(a(x1)))
B(x1) → A(c(x1))
A(b(x1)) → B(a(a(x1)))
A(a(x1)) → A(c(a(x1)))
A(b(x1)) → A(a(x1))
A(b(x1)) → A(x1)
a(b(x1)) → b(a(a(x1)))
b(x1) → c(a(c(x1)))
a(a(x1)) → a(c(a(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
B(x1) → A(c(x1))
A(b(x1)) → B(a(a(x1)))
A(a(x1)) → A(c(a(x1)))
A(b(x1)) → A(a(x1))
A(b(x1)) → A(x1)
a(b(x1)) → b(a(a(x1)))
b(x1) → c(a(c(x1)))
a(a(x1)) → a(c(a(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
A(b(x1)) → A(a(x1))
A(b(x1)) → A(x1)
a(b(x1)) → b(a(a(x1)))
b(x1) → c(a(c(x1)))
a(a(x1)) → a(c(a(x1)))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A(b(x1)) → A(a(x1))
A(b(x1)) → A(x1)
The value of delta used in the strict ordering is 2.
POL(c(x1)) = 0
POL(a(x1)) = x_1
POL(A(x1)) = (1/2)x_1
POL(b(x1)) = 4 + (4)x_1
a(b(x1)) → b(a(a(x1)))
b(x1) → c(a(c(x1)))
a(a(x1)) → a(c(a(x1)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
a(b(x1)) → b(a(a(x1)))
b(x1) → c(a(c(x1)))
a(a(x1)) → a(c(a(x1)))